Optimal $N$-term approximation by linear splines over anisotropic Delaunay triangulations
نویسندگان
چکیده
منابع مشابه
Optimal N-term approximation by linear splines over anisotropic Delaunay triangulations
Anisotropic triangulations provide efficient geometrical methods for sparse representations of bivariate functions from discrete data, in particular from image data. In previous work, we have proposed a locally adaptive method for efficient image approximation, called adaptive thinning, which relies on linear splines over anisotropic Delaunay triangulations. In this paper, we prove asymptotical...
متن کاملStability of Optimal-Order Approximation by Bivariate Splines over Arbitrary Triangulations
Let A be a triangulation of some polygonal domain in x2 and S i ( A ), the space of all bivariate Cr piecewise polynomials of total degree 5 k on A . In this paper, we construct a local basis of some subspace of the space S i ( A ),where k 2 3r + 2 , that can be used to provide the highest order of approximation, with the property that the approximation constant of this order is independent of ...
متن کاملImage compression by linear splines over adaptive triangulations
This paper proposes a new method for image compression. The method is based on the approximation of an image, regarded as a function, by a linear spline over an adapted triangulation, D(Y ), which is the Delaunay triangulation of a small set Y of significant pixels. The linear spline minimizes the distance to the image, measured by the mean square error, among all linear splines over D(Y ). The...
متن کاملLinear-Time Delaunay Triangulations Simplified∗
Recently it was shown that — under reasonable assumptions — Voronoi diagrams and Delaunay triangulations of planar point sets can be computed in time o(n log n), beating the classical comparisonbased lower bound. A number of increasingly faster randomized algorithms have been proposed, most recently a linear-time algorithm based on a randomized incremental construction that uses a combination o...
متن کاملConvexity preserving splines over triangulations
A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein–Bézier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2014
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2014-02908-6